منابع مشابه
Erasure-Resilient Property Testing
Property testers form an important class of sublinear algorithms. In the standard property testing model, an algorithm accesses the input function f : D 7→ R via an oracle. With very few exceptions, all property testers studied in this model rely on the oracle to provide function values at all queried domain points. However, in many realistic situations, the oracle may be unable to reveal the f...
متن کاملErasure-resilient codes from affine spaces
In this paper, we investigate erasure-resilient codes coming from Steiner 2-designs with block size k which can correct up to any k erasures. In view of applications it is desirable that such a code can also correct as many erasures of higher order as possible. Our main result is that the erasure-resilient code constructed from an affine space with block size q – a special Steiner 2-design – ca...
متن کاملar X iv : 1 60 7 . 05 78 6 v 1 [ cs . D S ] 2 0 Ju l 2 01 6 Erasure - Resilient Property Testing ∗
Property testers form an important class of sublinear algorithms. In the standard property testing model, an algorithm accesses the input function f : D 7→ R via an oracle. With very few exceptions, all property testers studied in this model rely on the oracle to provide function values at all queried domain points. However, in many realistic situations, the oracle may be unable to reveal the f...
متن کاملA linear time erasure-resilient code with nearly optimal recovery
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit p...
متن کاملAsymptotically optimal erasure-resilient codes for large disk arrays
Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in nite set theory. Solutions to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2018
ISSN: 0097-5397,1095-7111
DOI: 10.1137/16m1075661